Extending possibilistic logic over Godel logic

ثبت نشده
چکیده

In this paper we present several fuzzy logics trying to capture different notions of necessity (in the sense of Possibility theory) for Godel logic formulas. Based on different characterizations of necessity measures on fuzzy sets, a group of logics with Kripke style semantics are built over a restricted language, namely a two level language composed of nonmodal and modal formulas, the latter moreover not allowing for nested applications of the modal operator N. Completeness and some computational complexity results are shown. Source URL: https://www.iiia.csic.es/en/node/53977 Links [1] https://www.iiia.csic.es/en/staff/pilar-dellunde [2] https://www.iiia.csic.es/en/staff/llu%C3%ADs-godo [3] https://www.iiia.csic.es/en/staff/enrico-marchioni [4] https://www.iiia.csic.es/en/bibliography?f[keyword]=458 [5] https://www.iiia.csic.es/en/bibliography?f[keyword]=794 [6] https://www.iiia.csic.es/en/bibliography?f[keyword]=793 [7] https://www.iiia.csic.es/en/bibliography?f[keyword]=792

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the compactness property of extensions of first-order G"{o}del logic

We study three kinds of compactness in some variants of G"{o}del logic: compactness,entailment compactness, and approximate entailment compactness.For countable first-order underlying language we use the Henkinconstruction to prove the compactness property of extensions offirst-order g logic enriched by nullary connective or the Baaz'sprojection connective. In the case of uncountable first-orde...

متن کامل

Modeling Defeasible Argumentation within a Possibilistic Logic Framework with Fuzzy Unification

Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the treatment of possibilistic uncertainty at object-language level. This paper presents a first approach towards extending P-DeLP to incorporate fuzzy constants and fuzzy propositional variables. We focus on how to characteri...

متن کامل

Interval-Based Possibilistic Logic

Possibilistic logic is a well-known framework for dealing with uncertainty and reasoning under inconsistent knowledge bases. Standard possibilistic logic expressions are propositional logic formulas associated with positive real degrees belonging to [0,1]. However, in practice it may be difficult for an expert to provide exact degrees associated with formulas of a knowledge base. This paper pro...

متن کامل

Extending Description Logics with Uncertainty Reasoning in Possibilistic Logic

Possibilistic logic provides a convenient tool for dealing with inconsistency and handling uncertainty. In this paper, we propose possibilistic description logics as an extension of description logics. We give semantics and syntax of possibilistic description logics. We then define two inference services in possibilistic description logics. Since possibilistic inference suffers from the drownin...

متن کامل

Extending Answer Set Programming using Generalized Possibilistic Logic

Answer set programming (ASP) is a form of logic programming in which negation-as-failure is defined in a purely declarative way, based on the notion of a stable model. This short paper briefly explains how a recent generalization of possibilistic logic (GPL) can be used to characterize the semantics of answer set programming. This characterization has several advantages over existing characteri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017